Knuth-Morris-Pratt Algorithm: An Analysis

Efficient validation and construction of Knuth–Morris–Pratt arrays

Knuth-Morris-Pratt (KMP) arrays are known as the ”failure function” of the Knuth-Morris-Pratt string matching algorithm. We present an algorithm to check if an integer array is a KMP array. This gives a method for computing all the distinct KMP arrays.

Programming by Expression Refinement: the KMP Algorithm

The exercise is to calculate a pattern-matching algorithm, and specifically the algorithm originally due to Knuth, Morris, and Pratt [0]. We begin, however, with a smaller problem, one that turns out to be both similar to, and a subproblem of, the larger problem. We prefer to start with this because it will give the reader a chance to become familiar in a simple setting with the style and notat...

Formal Aspects of Polyvariant Specialization

We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris-Pratt algorithm from an inefficient but binding-time-improved string matcher. ∗Basic Research in Computer Science (www.brics.dk), funde...

Genetic validation of Trypanosoma brucei glutathione synthetase as an 1 essential enzyme 2 3 Chelsea Pratt

Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way

Given finite sets P and T of points in the Euclidean space R, the point pattern matching problem studied in this paper is to find all translations f ∈ R such that P + f ⊆ T . A fast search algorithm with some variants is presented for point patterns P that have regular grid–like geometric shape. The algorithm is analogous to the Knuth–Morris–Pratt algorithm of string matching. The time requirem...